Optimistic Concurrent Zero Knowledge
نویسندگان
چکیده
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is expected to require only a small constant number of rounds in practice. To prove that our protocol is secure, we identify a weak property of concurrent schedules—called footer-freeness—that suffices for efficient simulation.
منابع مشابه
A Note on the Round-Complexity of Concurrent Zero-Knowledge
We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Knowledge, at least eight rounds of interaction are essential for black-box simulation of non-trivial proof systems (i.e., systems for languages that are not in BPP). This improves previously known lower bounds, and rules out sever...
متن کاملConcurrent Zero - Knowledge : Reducing the Need for Timing
An interactive proof system (or argument) (P;V) is concurrent zero-knowledge if whenever the prover engages in polynomially many concurrent executions of (P;V), with (possibly distinct) colluding polynomial time bounded veriiers V1; : : : ; V poly(n) , the entire undertaking is zero-knowledge. Dwork, Naor, and Sahai recently showed the existence of a large class of concurrent zero-knowledge arg...
متن کاملOn the Concurrent Composition of Zero-Knowledge Proofs
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge proofs with one or multiple verifiers. Under this type of composition it is believed that standard zero-knowledge protocols are no longer zero-knowledge. We show that, modulo certain complexity assumptions, any statement...
متن کاملOn Concurrent and Resettable Zero-Knowledge Proofs for NP
A proof is concurrent zero-knowledge if it remains zero-knowledge when many copies of the proof are run in an asynchronous environment, such as the Internet. It is known that zeroknowledge is not necessarily preserved in such an environment [24, 29, 4]. Designing concurrent zero-knowledge proofs is a fundamental issue in the study of zero-knowledge since known zeroknowledge protocols cannot be ...
متن کاملPrecise Zero-Knowledge in Concurrent Setting
We present a stronger notion of zero-knowledge: precise concurrent zero-knowledge. Our notion captures the idea that the view of any verifier in concurrent interaction can be reconstructed in the almost same time (within a constant/polynomial factor). Precise zero-knowledge in stand-alone setting was introduced by Micali and Pass in STOC’06 (The original work used the term ”local zero-knowledge...
متن کامل